Graph-Theoretic Analysis of Belief System Dynamics under Logic Constraints
نویسندگان
چکیده
منابع مشابه
Network science on belief system dynamics under logic constraints.
Breakthroughs have been made in algorithmic approaches to understanding how individuals in a group influence each other to reach a consensus. However, what happens to the group consensus if it depends on several statements, one of which is proven false? Here, we show how the existence of logical constraints on beliefs affect the collective convergence to a shared belief system and, in contrast,...
متن کاملEvolving Graph Databases under Description Logic Constraints
In the setting of graph-structured data, description logics are well suited to impose constraints that capture the semantics of the domain of interest. When the data evolves as a result of operations carried out by users or applications, it is important to ensure that the satisfaction of the constraints is preserved, analogously to the consistency requirement for transactions in relational data...
متن کاملA Logic of Graph Constraints
Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicability of transformation rules. However, we believe that graph constraints may also play a significant role in the area of visual software modelling or in the specification and verification of semi-structured documents or websit...
متن کاملProbabilistic Logic under Coherence, Model-theoretic Probabilistic Logic, and Default Reasoning in System Probabilistic Logic under Coherence, Model-theoretic Probabilistic Logic, and Default Reasoning in System
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model-theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabil...
متن کاملMax-Cut Under Graph Constraints
An instance of the graph-constrained max-cut (GCMC) problem consists of (i) an undirected graph G = (V,E) and (ii) edge-weights c : ( V 2 ) → R+ on a complete undirected graph. The objective is to find a subset S ⊆ V of vertices satisfying some graph-based constraint in G that maximizes the weight ∑ u∈S,v 6∈S cuv of edges in the cut (S, V \ S). The types of graph constraints we can handle inclu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2019
ISSN: 2045-2322
DOI: 10.1038/s41598-019-45076-4